[python]: path between two nodes
Posted
by www.yegorov-p.ru
on Stack Overflow
See other posts from Stack Overflow
or by www.yegorov-p.ru
Published on 2010-04-09T08:39:18Z
Indexed on
2010/04/09
8:43 UTC
Read the original article
Hit count: 495
I'm using networkx to work with graphs. I have pretty large graph (it's near 200 nodes in it) and I try to find all possible paths between two nodes. But, as I understand, networkx can find only shortest path. How can I get not just shortest path, but all possible paths?
© Stack Overflow or respective owner